//
// Created by xili on 2024/8/9 21:34.
// Go big or go home.
//
#include "leetcode.h"

class Solution {
public:
    bool isPossibleToSplit(vector<int> &nums) {
        unordered_map<int, int> ump;
        for (auto &item: nums) {
            if (++ump[item] > 2) {
                return false;
            }
        }
        return true;
    }
};